n = int(input())
w = list(map(int, input().split()))
one = w.count(100)
two = w.count(200)
b_200 = two%2
b_100 = one - (b_200*2)
if(b_100>=0 and b_100%2 == 0):
print('YES')
else:
print('NO')#include<bits/stdc++.h>
#define fi(n) for(int i=0;i<n;i++)
#define fj(n) for(int j=0;j<n;j++)
#define fk(n) for(int k=0;k<n;k++)
typedef long long ll;
int N = 1000000007;
ll MAX = 1e18;
using namespace std;
typedef vector<int> vi;
typedef vector<ll> vll;
ll a, b, c, n, i, j, k, t, x, m, r, l;
void bansal(){
cin>>n;
b = 0;
c = 0;
fi(n){
cin>>a;
if(a==200) c++;
else b++;
}
a = c*200 + b*100;
a/=2;
if(a%100){
cout<<"NO";
return;
}
if(a%200!=0&&b==0){
cout<<"NO";
return;
}
cout<<"YES";
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
bool f = false;
string s[100], st;
t=1;
while(t){
bansal();
cout<<endl;
t--;
}
return 0;
}6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |